a generalized implicit enumeration algorithm for a class of integer nonlinear programming problems

نویسندگان

m.s sabbagh

m roshanjooy

چکیده

presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. the method is easy to understand and implement, yet very effec-tive in dealing with many integer programming problems, including knapsack problems, reliability optimiza-tion, and spare allocation problems. to see some application of the generalized algorithm, we notice that the branch-and-bound is the popular method to solve integer linear programming problems. but branch-and-bound cannot efficiently solve all integer linear programming problems. for example, de loera et al. in their 2005 paper discuss some knapsack problems that cplex cannot solve in hours. we use our generalized algo-rithm to find a global or near global optimal solutions for those problems, in less than 100 seconds. the algo-rithm is based on function values only; it does not require continuity or differentiability of the problem func-tions. this allows its use on problems whose functions cannot be expressed in closed algebraic form. the re-liability and efficiency of the proposed algorithm has been demonstrated on some integer optimization prob-lems taken from the literature.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A generalized implicit enumeration algorithm for a class of integer nonlinear programming problems

Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...

متن کامل

A new approach for solving neutrosophic integer programming problems

Linear programming is one of the most important usages of operation research methods in real life, that includes of one objective function and one or several constraints which can be in the form of equality and inequality. Most of the problems in the real world are include of inconsistent and astute uncertainty, because of this reason we can’t obtain the optimal solution easily. In this paper, ...

متن کامل

A dynamic programming approach for solving nonlinear knapsack problems

Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...

متن کامل

An Improved Implicit Enumeration Approach for Integer Programming

This paper synthesizes the Balasian implicit enumeration approach to integer linear programming with the approach typified by LAND AND DOIG and by ROY, BEBTIER, AND NGHIEM. The synthesis results from the use of an imbedded linear program to compute surrogate constraints that are as 'strong' as possible in a sense slightly different from that originally used by GLOVBK. A simple implicit enumerat...

متن کامل

A mixed integer nonlinear programming model for optimizing a gas pipeline transmission linear network

The technical equipment developed and used in both installation and operation processes in refineries, oil and gas pipelines, and gas booster stations has always been expensive. Hence, managers at different organizational levels are keen to find methods to control and reduce these costs. Generally speaking, the operators in a gas booster station choose the operating devices without considering ...

متن کامل

A Particle Swarm Optimization Algorithm for Mixed-Variable Nonlinear Problems

Many engineering design problems involve a combination of both continuous anddiscrete variables. However, the number of studies scarcely exceeds a few on mixed-variableproblems. In this research Particle Swarm Optimization (PSO) algorithm is employed to solve mixedvariablenonlinear problems. PSO is an efficient method of dealing with nonlinear and non-convexoptimization problems. In this paper,...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
journal of industrial engineering, international

ISSN 1735-5702

دوره 4

شماره 6 2008

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023